Fast transforms over finite fields of characteristic two

We describe new fast algorithms for evaluation and interpolation on the “novel” polynomial basis over finite fields of characteristic two introduced by Lin et al. (2014). Fast are also described converting between their monomial basis, as well to from Newton associated with points algorithms. Combining yields a truncated additive Fourier transform (FFT) inverse FFT which improve upon some previous when field possesses an appropriate tower subfields.